package alex;

/**
 * 求给定二叉树的最大深度，
 * 最大深度是指树的根结点到最远叶子结点的最长路径上结点的数量。
 * <p>
 * Given a binary tree, find its maximum depth.
 * The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
 *
 * @author shufei
 */
public class Solution20200108 {
    public static void main(String[] args) {
    }

    public int maxDepth(TreeNode root) {

    }
}


class TreeNode {
    int val;

    TreeNode left;

    TreeNode right;

    TreeNode right;

    public TreeNode(int[] data) {
        if (data != null && data.length > 0) {
            for (int item : data) {

            }
        }
    }

    TreeNode(int x) {
        val = x;
    }

    public int getVal() {
        return val;
    }

    public void setVal(int val) {
        this.val = val;
    }

    @Override
    public String toString() {
        return "TreeNode{" +
                "val=" + val +
                ", left=" + left +
                ", right=" + right +
                '}';
    }
}
